Improved One-to-Many Record Linkage using One Class Clustering Tree
نویسنده
چکیده
Record linkage is traditionally performed among the entities of same type. It can be done based on entities that may or may not share a common identifier. In this paper we propose a new linkage method that performs linkage between matching entities of different data types as well. The proposed technique is based on one-class clustering tree that characterizes the entities which are to be linked. The tree is built in such a way that it is easy to understand and can be transformed into association rules. The inner nodes of the tree consist of features of the first set of entities. The leaves of the tree represent features of the second set that are matching. The data is split using two splitting criteria. Also two pruning methods are used for creating one-class clustering tree. The proposed system results better in performance of precision and recall.
منابع مشابه
Text Data Linkage of Different Entities Using Occt-One Class Clustering Tree
A new one to many and many to many data linkage is based on a One-Class Clustering Tree (OCCT) which characterizes the entities that should be linked together. It is evaluated using datasets of Data leakage prevention, Recommender system and Fraud detection. The tree is built such that it is easy to understand and transform into Association rules. The Data Linkage is closely related to entity r...
متن کاملImplementing One to Many Data Linkage Using One Class Clustering Tree
The task of data linkage is performed among entities of the same type. The one to one data linkage links one record from one table and another one record in another table. It is extremely necessary to develop linkage techniques that link between matching entities of different types and also to improve one to one linkage to one to many data linkage as well. The proposed method emphasizes on one-...
متن کاملA Decision Tree Based Record Linkage for Recommendation Systems
Record linkage merges all the records relating to the same entity from multiple datasets, at the entity level. It is the initial data preparation phase for most of the database projects. Traditionally one to one data linkage is performed among the entities of same type with common unique identifier. The proposed one to many and/or many to many record linkage method is able to link the entities ...
متن کاملMonotone Linkage Clustering and Quasi-Convex Set Functions
Greedily seriating objects one by one is implicitly employed in many heuristic clustering procedures, which can be described in terms of a linkage function measuring entity-to-set dissimilarities. A well-known clustering technique, single linkage clustering, can be considered as an example of the seriation procedures (actually, based on the minimum spanning tree construction) leading to the glo...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014